Degree sets for graphs
نویسندگان
چکیده
منابع مشابه
Signed degree sets in signed bipartite graphs
A signed bipartite graph G(U, V) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V) is the number of positive edges incident with x less the number of negative edges incident with x. The set S of distinct signed degrees of the vertices of G(U, V) is called its signed degree set. In this paper, we prove that every set of ...
متن کاملTenacity and rupture degree parameters for trapezoid graphs
Reliability of networks is an important issue in the field of graph and network. Computation of network vulnerability parameters is NP-complete for popular network topologies such as tree, Mesh, Cube, etc.In this paper, we will show that the tenacity and rupture degree parameters for trapezoid graphs can be computed in polynomial time.
متن کاملOn degree sets and the minimum orders in bipartite graphs
For any simple graph G, let D(G) denote the degree set {degG(v) : v ∈ V (G)}. Let S be a finite, nonempty set of positive integers. In this paper, we first determine the families of graphs G which are unicyclic, bipartite satisfying D(G) = S, and further obtain the graphs of minimum orders in such families. More general, for a given pair (S, T ) of finite, nonempty sets of positive integers of ...
متن کاملGreedy Approximations of Independent Sets in Low Degree Graphs
We investigate the power of a family of greedy algorithms for the independent set problem in cubic graphs and graphs of maximum degree three. These algorithm iteratively select vertices of minimum degree, but diier in the secondary rule for choosing among many candidates. We study three such algorithms, and prove tight performance ratios, with the best one being 9=7 1:28. All of these algorithm...
متن کاملIndependent Sets in Graphs with given Minimum Degree
The enumeration of independent sets in graphs with various restrictions has been a topic of much interest of late. Let i(G) be the number of independent sets in a graph G and let it(G) be the number of independent sets in G of size t. Kahn used entropy to show that if G is an r-regular bipartite graph with n vertices, then i(G) ≤ i(Kr,r). Zhao used bipartite double covers to extend this bound t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Mathematicae
سال: 1977
ISSN: 0016-2736,1730-6329
DOI: 10.4064/fm-95-3-189-194